Generating anomalous elliptic curves
نویسندگان
چکیده
In 1999, Smart has shown how to solve in linear time ECDLP for elliptic curves of trace 1 defined over a prime finite field Fp, the so-called anomalous elliptic curves. In this article, we show how to construct such cryptographically weak curves for primes p of industrial length, using complex multiplication theory.
منابع مشابه
Faster Attacks on Elliptic Curve Cryptosystems
The previously best attack known on elliptic curve cryptosystems used in practice was the parallel collision search based on Pollard's-method. The complexity of this attack is the square root of the prime order of the generating point used. For arbitrary curves, typically deened over GF(p) or GF(2 m), the attack time can be reduced by a factor or p 2, a small improvement. For subbeld curves, th...
متن کاملTwo Discrete Log Algorithms for Super-Anomalous Elliptic Curves and Their Applications
Z/nZ (n = ∏k i=1 pi ei ) are defined by extending anomalous elliptic curves over a prime filed Fp. They have n points over a ring Z/nZ and pi points over Fpi for all pi. We generalize Satoh-Araki-Smart algorithm [10], [11] and Rück algorithm [9], which solve a discrete logarithm problem over anomalous elliptic curves. We prove that a “discrete logarithm problem over super-anomalous elliptic cur...
متن کاملOn Remarks of Lifting Problems for Elliptic Curves
The Elliptic Curve Discrete Logarithm Problem(ECDLP) is known to be an exponential time problem except the cases of smooth curves, supersingular curves and anomalous curves. Recently, several new methods to solve ECDLP on a prime eld were proposed. All of them try to solve ECDLP on a prime eld by lifting a given elliptic curve to low rank elliptic curves de ned over the rationals. In this exten...
متن کاملA reduction of the space for the parallelized Pollard lambda search on elliptic curves over prime finite fields and on anomalous binary elliptic curves
Let E be an elliptic curve defined over a prime finite field Fp by a Weierstrass equation. In this paper we introduce a new partition of E(Fp) into classes which are generally larger than {±R}. We give an effective procedure to compute representatives of such classes. So one can iterate the pseudorandom function, related to a discrete logarithm problem in E(Fp), on the set of representatives of...
متن کاملGenerating Elliptic Curves over Finite Fields Part I: Generating by Complex Multiplication
We study the theory of rational points on elliptic curves over nite elds and the theory of complex multiplication through which we construct elliptic curves over F p such that their orders of the group of rational points over F p are of the form mr where r is a prime and m is a small integer.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 93 شماره
صفحات -
تاریخ انتشار 2005